Theorem brrpssg 7680

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 3463	. . 3 ⊢ (𝐵 ∈ 𝑉 → 𝐵 ∈ V)
2		relrpss 7679	. . . 4 ⊢ Rel [⊊]
3	2	brrelex1i 5688	. . 3 ⊢ (𝐴 [⊊] 𝐵 → 𝐴 ∈ V)
4	1, 3	anim12i 614	. 2 ⊢ ((𝐵 ∈ 𝑉 ∧ 𝐴 [⊊] 𝐵) → (𝐵 ∈ V ∧ 𝐴 ∈ V))
5	1	adantr 480	. . 3 ⊢ ((𝐵 ∈ 𝑉 ∧ 𝐴 ⊊ 𝐵) → 𝐵 ∈ V)
6		pssss 4052	. . . 4 ⊢ (𝐴 ⊊ 𝐵 → 𝐴 ⊆ 𝐵)
7		ssexg 5270	. . . 4 ⊢ ((𝐴 ⊆ 𝐵 ∧ 𝐵 ∈ V) → 𝐴 ∈ V)
8	6, 1, 7	syl2anr 598	. . 3 ⊢ ((𝐵 ∈ 𝑉 ∧ 𝐴 ⊊ 𝐵) → 𝐴 ∈ V)
9	5, 8	jca 511	. 2 ⊢ ((𝐵 ∈ 𝑉 ∧ 𝐴 ⊊ 𝐵) → (𝐵 ∈ V ∧ 𝐴 ∈ V))
10		psseq1 4044	. . . 4 ⊢ (𝑥 = 𝐴 → (𝑥 ⊊ 𝑦 ↔ 𝐴 ⊊ 𝑦))
11		psseq2 4045	. . . 4 ⊢ (𝑦 = 𝐵 → (𝐴 ⊊ 𝑦 ↔ 𝐴 ⊊ 𝐵))
12		df-rpss 7678	. . . 4 ⊢ [⊊] = {⟨𝑥, 𝑦⟩ ∣ 𝑥 ⊊ 𝑦}
13	10, 11, 12	brabg 5495	. . 3 ⊢ ((𝐴 ∈ V ∧ 𝐵 ∈ V) → (𝐴 [⊊] 𝐵 ↔ 𝐴 ⊊ 𝐵))
14	13	ancoms 458	. 2 ⊢ ((𝐵 ∈ V ∧ 𝐴 ∈ V) → (𝐴 [⊊] 𝐵 ↔ 𝐴 ⊊ 𝐵))
15	4, 9, 14	pm5.21nd 802	1 ⊢ (𝐵 ∈ 𝑉 → (𝐴 [⊊] 𝐵 ↔ 𝐴 ⊊ 𝐵))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∈ wcel 2114  Vcvv 3442   ⊆ wss 3903   ⊊ wpss 3904   class class class wbr 5100   [⊊] crpss 7677

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-ext 2709  ax-sep 5243  ax-pr 5379

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-sb 2069  df-clab 2716  df-cleq 2729  df-clel 2812  df-ne 2934  df-ral 3053  df-rex 3063  df-rab 3402  df-v 3444  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-pss 3923  df-nul 4288  df-if 4482  df-sn 4583  df-pr 4585  df-op 4589  df-br 5101  df-opab 5163  df-xp 5638  df-rel 5639  df-rpss 7678

This theorem is referenced by:  brrpss  7681  sorpssi  7684