Theorem brrpssg 7670

Description: The proper subset relation on sets is the same as class proper subsethood. (Contributed by Stefan O'Rear, 2-Nov-2014.)

Assertion

Ref	Expression
brrpssg	⊢ (𝐵 ∈ 𝑉 → (𝐴 [⊊] 𝐵 ↔ 𝐴 ⊊ 𝐵))

Proof of Theorem brrpssg

Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		elex 3461	. . 3 ⊢ (𝐵 ∈ 𝑉 → 𝐵 ∈ V)
2		relrpss 7669	. . . 4 ⊢ Rel [⊊]
3	2	brrelex1i 5680	. . 3 ⊢ (𝐴 [⊊] 𝐵 → 𝐴 ∈ V)
4	1, 3	anim12i 613	. 2 ⊢ ((𝐵 ∈ 𝑉 ∧ 𝐴 [⊊] 𝐵) → (𝐵 ∈ V ∧ 𝐴 ∈ V))
5	1	adantr 480	. . 3 ⊢ ((𝐵 ∈ 𝑉 ∧ 𝐴 ⊊ 𝐵) → 𝐵 ∈ V)
6		pssss 4050	. . . 4 ⊢ (𝐴 ⊊ 𝐵 → 𝐴 ⊆ 𝐵)
7		ssexg 5268	. . . 4 ⊢ ((𝐴 ⊆ 𝐵 ∧ 𝐵 ∈ V) → 𝐴 ∈ V)
8	6, 1, 7	syl2anr 597	. . 3 ⊢ ((𝐵 ∈ 𝑉 ∧ 𝐴 ⊊ 𝐵) → 𝐴 ∈ V)
9	5, 8	jca 511	. 2 ⊢ ((𝐵 ∈ 𝑉 ∧ 𝐴 ⊊ 𝐵) → (𝐵 ∈ V ∧ 𝐴 ∈ V))
10		psseq1 4042	. . . 4 ⊢ (𝑥 = 𝐴 → (𝑥 ⊊ 𝑦 ↔ 𝐴 ⊊ 𝑦))
11		psseq2 4043	. . . 4 ⊢ (𝑦 = 𝐵 → (𝐴 ⊊ 𝑦 ↔ 𝐴 ⊊ 𝐵))
12		df-rpss 7668	. . . 4 ⊢ [⊊] = {⟨𝑥, 𝑦⟩ ∣ 𝑥 ⊊ 𝑦}
13	10, 11, 12	brabg 5487	. . 3 ⊢ ((𝐴 ∈ V ∧ 𝐵 ∈ V) → (𝐴 [⊊] 𝐵 ↔ 𝐴 ⊊ 𝐵))
14	13	ancoms 458	. 2 ⊢ ((𝐵 ∈ V ∧ 𝐴 ∈ V) → (𝐴 [⊊] 𝐵 ↔ 𝐴 ⊊ 𝐵))
15	4, 9, 14	pm5.21nd 801	1 ⊢ (𝐵 ∈ 𝑉 → (𝐴 [⊊] 𝐵 ↔ 𝐴 ⊊ 𝐵))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∈ wcel 2113  Vcvv 3440   ⊆ wss 3901   ⊊ wpss 3902   class class class wbr 5098   [⊊] crpss 7667

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-ext 2708  ax-sep 5241  ax-nul 5251  ax-pr 5377

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-sb 2068  df-clab 2715  df-cleq 2728  df-clel 2811  df-ne 2933  df-ral 3052  df-rex 3061  df-rab 3400  df-v 3442  df-dif 3904  df-un 3906  df-in 3908  df-ss 3918  df-pss 3921  df-nul 4286  df-if 4480  df-sn 4581  df-pr 4583  df-op 4587  df-br 5099  df-opab 5161  df-xp 5630  df-rel 5631  df-rpss 7668

This theorem is referenced by:  brrpss  7671  sorpssi  7674