Once you know the basic formula P(E|F) = P(E ∩ F)/P(F), the CBSE Class 12 syllabus expects you to go one level deeper: three structural properties describing how conditional probability behaves. These show up directly in board exam proofs, “evaluate” style short-answer questions, and as building blocks for the multiplication theorem and Bayes’ theorem later in the chapter. This post walks through all three, with proofs and worked examples.

Why Properties Matter, Not Just the Formula

Many students memorise P(E|F) = P(E ∩ F)/P(F) and stop there. But exam papers often ask you to prove a property, or use one mid-solution without stating it. Not recognising P(E’|F) = 1 − P(E|F) as a shortcut means far more arithmetic than necessary. Treat these properties as time-saving tools, not facts to memorise in isolation.

Property 1: P(S|F) = P(F|F) = 1

Once F is known to have occurred, the probability of the entire sample space S given F is 1 — and so is the probability of F itself given F.

Proof

By definition, P(S|F) = P(S ∩ F)/P(F). Since F is a subset of S, S ∩ F = F, so P(S|F) = P(F)/P(F) = 1. Similarly, P(F|F) = P(F ∩ F)/P(F) = P(F)/P(F) = 1.

Why This Makes Sense

Once you know F has occurred, you’re certain something within F has happened, and equally certain F itself has happened — the “given” information has already resolved that question.

Property 2: The Addition Rule Under Conditioning

For any two events A and B in a sample space S, and an event F with P(F) ≠ 0:

P((A ∪ B)|F) = P(A|F) + P(B|F) − P((A ∩ B)|F)

If A and B happen to be disjoint (mutually exclusive), this simplifies to:

P((A ∪ B)|F) = P(A|F) + P(B|F)

Proof

Start from the definition: P((A ∪ B)|F) = P[(A ∪ B) ∩ F] / P(F). By the distributive law, (A ∪ B) ∩ F = (A ∩ F) ∪ (B ∩ F), so:

P((A ∪ B)|F) = P[(A ∩ F) ∪ (B ∩ F)] / P(F)

Using the ordinary addition rule on the numerator: P[(A ∩ F) ∪ (B ∩ F)] = P(A ∩ F) + P(B ∩ F) − P(A ∩ B ∩ F). Dividing every term by P(F):

P((A ∪ B)|F) = P(A|F) + P(B|F) − P((A ∩ B)|F)

When A and B are disjoint, A ∩ B = φ, so P((A ∩ B)|F) = 0, leaving P((A ∪ B)|F) = P(A|F) + P(B|F).

Why This Matters

This is the ordinary addition rule applied inside the “reduced” sample space F, confirming conditional probability behaves like a genuine probability measure once F is fixed — used later in Bayes’ theorem.

Property 3: P(E’|F) = 1 − P(E|F)

This is the conditional version of the complement rule, and one of the most useful shortcuts in the chapter.

Proof

From Property 1, P(S|F) = 1. Since S = E ∪ E’, and E, E’ are disjoint, Property 2 gives P(S|F) = P(E|F) + P(E’|F). Since P(S|F) = 1:

P(E|F) + P(E’|F) = 1, so P(E’|F) = 1 − P(E|F)

Why This Matters

For “not E given F” questions, subtract P(E|F) from 1 instead of recomputing — handy in “at least one” versus “none” word problems.

Solved Examples Using These Properties

Example 1 — Direct Application

If P(A) = 7/13, P(B) = 9/13, and P(A ∩ B) = 4/13, evaluate P(A|B).

P(A|B) = P(A ∩ B)/P(B) = (4/13)/(9/13) = 4/9

This is the kind of “evaluate” question where Property 3 often follows: if asked for P(A’|B), simply compute 1 − 4/9 = 5/9 instead of redoing the calculation.

Example 2 — Using the Complement Property

A die is rolled once. Let E be “the number is a multiple of 3” and F be “the number is even.” Find P(E|F), then P(E’|F).

From S = {1, 2, 3, 4, 5, 6}: E = {3, 6}, F = {2, 4, 6}, E ∩ F = {6}.

P(F) = 1/2, P(E ∩ F) = 1/6, so P(E|F) = (1/6)/(1/2) = 1/3

By Property 3: P(E’|F) = 1 − 1/3 = 2/3

This checks out: {2, 4} are the two even numbers that aren’t multiples of 3, out of three even numbers total, giving 2/3.

Example 3 — Addition Rule With Disjoint Events

A coin is tossed three times. Let F be “at least one tail,” A be “exactly two heads,” B be “exactly three heads.” Since A and B are disjoint, find P((A ∪ B)|F).

The sample space has 8 equally likely outcomes. F = everything except HHH, so P(F) = 7/8.

A ∩ F = {HHT, HTH, THH} → P(A|F) = 3/7 B ∩ F = { } (HHH is excluded from F) → P(B|F) = 0

By Property 2: P((A ∪ B)|F) = 3/7 + 0 = 3/7

Common Mistakes Students Make

  1. Forgetting the subtraction term. Writing P((A ∪ B)|F) = P(A|F) + P(B|F) even when A, B aren’t disjoint — check for overlap first.

  2. Misapplying Property 3. It only works when E’ is the true complement of E.

  3. Skipping verification. Cross-checking against the raw sample space, as in Example 2, catches errors fast.

Build Proof-Writing Confidence for Boards

Property-based proof questions are a board exam favourite and appear in CUET Maths too. Get unlimited AI-generated practice on conditional probability proofs, with instant explanations with PrepCoin packs from ₹59 on ChampionsPrep — built for CBSE and Maharashtra Board Class 11–12 Commerce students.

Properties of Conditional Probability Class 12 (With Proofs and Examples) podcast artwork
Audio LessonClass 12

Properties of Conditional Probability Class 12 (With Proofs and Examples)

ChampionsPrep MathematicsEpisode 1317:08

Subscribe in any podcast app:

Frequently Asked Questions

What are the three main properties of conditional probability? +

Property 1: P(S|F) equals P(F|F) equals 1. Property 2: P((A union B)|F) equals P(A|F) plus P(B|F) minus P((A intersection B)|F), simplifying to a sum when A and B are disjoint. Property 3: P(E'|F) equals 1 minus P(E|F).

Why is P(S|F) equal to 1? +

Because S intersected with F equals F, since F is a subset of S, so P(S|F) equals P(F) divided by P(F), which is 1.

Does the addition rule for conditional probability always need the subtraction term? +

Only when the two events overlap. If the events are mutually exclusive, the intersection term is zero and drops out, leaving a simple sum of the two conditional probabilities.

How is P(E'|F) equals 1 minus P(E|F) derived? +

It follows from the first two properties: since the sample space equals E union E' and they are disjoint, P(S|F) equals P(E|F) plus P(E'|F), which equals 1, rearranging to give the complement property.

Where are these properties used later in the probability chapter? +

They are essential building blocks for the multiplication theorem, the theorem of total probability, and Bayes' theorem, all of which rely on treating conditional probability as a valid probability measure.