Theorem brrpssg 7727

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 3471	. . 3 ⊢ (𝐵 ∈ 𝑉 → 𝐵 ∈ V)
2		relrpss 7726	. . . 4 ⊢ Rel [⊊]
3	2	brrelex1i 5711	. . 3 ⊢ (𝐴 [⊊] 𝐵 → 𝐴 ∈ V)
4	1, 3	anim12i 625	. 2 ⊢ ((𝐵 ∈ 𝑉 ∧ 𝐴 [⊊] 𝐵) → (𝐵 ∈ V ∧ 𝐴 ∈ V))
5	1	adantr 486	. . 3 ⊢ ((𝐵 ∈ 𝑉 ∧ 𝐴 ⊊ 𝐵) → 𝐵 ∈ V)
6		pssss 4046	. . . 4 ⊢ (𝐴 ⊊ 𝐵 → 𝐴 ⊆ 𝐵)
7		ssexg 5284	. . . 4 ⊢ ((𝐴 ⊆ 𝐵 ∧ 𝐵 ∈ V) → 𝐴 ∈ V)
8	6, 1, 7	syl2anr 609	. . 3 ⊢ ((𝐵 ∈ 𝑉 ∧ 𝐴 ⊊ 𝐵) → 𝐴 ∈ V)
9	5, 8	jca 521	. 2 ⊢ ((𝐵 ∈ 𝑉 ∧ 𝐴 ⊊ 𝐵) → (𝐵 ∈ V ∧ 𝐴 ∈ V))
10		psseq1 4038	. . . 4 ⊢ (𝑥 = 𝐴 → (𝑥 ⊊ 𝑦 ↔ 𝐴 ⊊ 𝑦))
11		psseq2 4039	. . . 4 ⊢ (𝑦 = 𝐵 → (𝐴 ⊊ 𝑦 ↔ 𝐴 ⊊ 𝐵))
12		df-rpss 7725	. . . 4 ⊢ [⊊] = {⟨𝑥, 𝑦⟩ ∣ 𝑥 ⊊ 𝑦}
13	10, 11, 12	brabg 5518	. . 3 ⊢ ((𝐴 ∈ V ∧ 𝐵 ∈ V) → (𝐴 [⊊] 𝐵 ↔ 𝐴 ⊊ 𝐵))
14	13	ancoms 464	. 2 ⊢ ((𝐵 ∈ V ∧ 𝐴 ∈ V) → (𝐴 [⊊] 𝐵 ↔ 𝐴 ⊊ 𝐵))
15	4, 9, 14	pm5.21nd 814	1 ⊢ (𝐵 ∈ 𝑉 → (𝐴 [⊊] 𝐵 ↔ 𝐴 ⊊ 𝐵))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∈ wcel 2145  Vcvv 3450   ⊆ wss 3899   ⊊ wpss 3900   class class class wbr 5103   [⊊] crpss 7724

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-ext 2732  ax-sep 5251  ax-pr 5398

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2739  df-cleq 2752  df-clel 2835  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-br 5104  df-opab 5168  df-xp 5661  df-rel 5662  df-rpss 7725

This theorem is used by:  brrpss  7728  sorpssi  7731