Users' Mathboxes Mathbox for Richard Penner < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  rclexi Structured version   Visualization version   GIF version

Theorem rclexi 44574
Description: The reflexive closure of a set exists. (Contributed by RP, 27-Oct-2020.)
Hypothesis
Ref Expression
rclexi.1 𝐴 ∈ 𝑉
Assertion
Ref Expression
rclexi ∩ {𝑥 ∣ (𝐴 ⊆ 𝑥 ∧ ( I ↾ (dom 𝑥 ∪ ran 𝑥)) ⊆ 𝑥)} ∈ V
Distinct variable group:   𝑥,𝐴
Allowed substitution hint:   𝑉(𝑥)

Proof of Theorem rclexi
StepHypRef Expression
1 ssun1 4124 . 2 𝐴 ⊆ (𝐴 ∪ ( I ↾ (dom 𝐴 ∪ ran 𝐴)))
2 dmun 5892 . . . . . . 7 dom (𝐴 ∪ ( I ↾ (dom 𝐴 ∪ ran 𝐴))) = (dom 𝐴 ∪ dom ( I ↾ (dom 𝐴 ∪ ran 𝐴)))
3 dmresi 6046 . . . . . . . 8 dom ( I ↾ (dom 𝐴 ∪ ran 𝐴)) = (dom 𝐴 ∪ ran 𝐴)
43uneq2i 4112 . . . . . . 7 (dom 𝐴 ∪ dom ( I ↾ (dom 𝐴 ∪ ran 𝐴))) = (dom 𝐴 ∪ (dom 𝐴 ∪ ran 𝐴))
5 ssun1 4124 . . . . . . . 8 dom 𝐴 ⊆ (dom 𝐴 ∪ ran 𝐴)
6 ssequn1 4132 . . . . . . . 8 (dom 𝐴 ⊆ (dom 𝐴 ∪ ran 𝐴) ↔ (dom 𝐴 ∪ (dom 𝐴 ∪ ran 𝐴)) = (dom 𝐴 ∪ ran 𝐴))
75, 6mpbi 233 . . . . . . 7 (dom 𝐴 ∪ (dom 𝐴 ∪ ran 𝐴)) = (dom 𝐴 ∪ ran 𝐴)
82, 4, 73eqtri 2788 . . . . . 6 dom (𝐴 ∪ ( I ↾ (dom 𝐴 ∪ ran 𝐴))) = (dom 𝐴 ∪ ran 𝐴)
9 rnun 6134 . . . . . . 7 ran (𝐴 ∪ ( I ↾ (dom 𝐴 ∪ ran 𝐴))) = (ran 𝐴 ∪ ran ( I ↾ (dom 𝐴 ∪ ran 𝐴)))
10 rnresi 6069 . . . . . . . 8 ran ( I ↾ (dom 𝐴 ∪ ran 𝐴)) = (dom 𝐴 ∪ ran 𝐴)
1110uneq2i 4112 . . . . . . 7 (ran 𝐴 ∪ ran ( I ↾ (dom 𝐴 ∪ ran 𝐴))) = (ran 𝐴 ∪ (dom 𝐴 ∪ ran 𝐴))
12 ssun2 4125 . . . . . . . 8 ran 𝐴 ⊆ (dom 𝐴 ∪ ran 𝐴)
13 ssequn1 4132 . . . . . . . 8 (ran 𝐴 ⊆ (dom 𝐴 ∪ ran 𝐴) ↔ (ran 𝐴 ∪ (dom 𝐴 ∪ ran 𝐴)) = (dom 𝐴 ∪ ran 𝐴))
1412, 13mpbi 233 . . . . . . 7 (ran 𝐴 ∪ (dom 𝐴 ∪ ran 𝐴)) = (dom 𝐴 ∪ ran 𝐴)
159, 11, 143eqtri 2788 . . . . . 6 ran (𝐴 ∪ ( I ↾ (dom 𝐴 ∪ ran 𝐴))) = (dom 𝐴 ∪ ran 𝐴)
168, 15uneq12i 4113 . . . . 5 (dom (𝐴 ∪ ( I ↾ (dom 𝐴 ∪ ran 𝐴))) ∪ ran (𝐴 ∪ ( I ↾ (dom 𝐴 ∪ ran 𝐴)))) = ((dom 𝐴 ∪ ran 𝐴) ∪ (dom 𝐴 ∪ ran 𝐴))
17 unidm 4104 . . . . 5 ((dom 𝐴 ∪ ran 𝐴) ∪ (dom 𝐴 ∪ ran 𝐴)) = (dom 𝐴 ∪ ran 𝐴)
1816, 17eqtri 2784 . . . 4 (dom (𝐴 ∪ ( I ↾ (dom 𝐴 ∪ ran 𝐴))) ∪ ran (𝐴 ∪ ( I ↾ (dom 𝐴 ∪ ran 𝐴)))) = (dom 𝐴 ∪ ran 𝐴)
1918reseq2i 5967 . . 3 ( I ↾ (dom (𝐴 ∪ ( I ↾ (dom 𝐴 ∪ ran 𝐴))) ∪ ran (𝐴 ∪ ( I ↾ (dom 𝐴 ∪ ran 𝐴))))) = ( I ↾ (dom 𝐴 ∪ ran 𝐴))
20 ssun2 4125 . . 3 ( I ↾ (dom 𝐴 ∪ ran 𝐴)) ⊆ (𝐴 ∪ ( I ↾ (dom 𝐴 ∪ ran 𝐴)))
2119, 20eqsstri 3977 . 2 ( I ↾ (dom (𝐴 ∪ ( I ↾ (dom 𝐴 ∪ ran 𝐴))) ∪ ran (𝐴 ∪ ( I ↾ (dom 𝐴 ∪ ran 𝐴))))) ⊆ (𝐴 ∪ ( I ↾ (dom 𝐴 ∪ ran 𝐴)))
22 rclexi.1 . . . . . 6 𝐴 ∈ 𝑉
2322elexi 3473 . . . . 5 𝐴 ∈ V
24 dmexg 7902 . . . . . . . 8 (𝐴 ∈ 𝑉 → dom 𝐴 ∈ V)
25 rnexg 7903 . . . . . . . 8 (𝐴 ∈ 𝑉 → ran 𝐴 ∈ V)
2624, 25unexd 7757 . . . . . . 7 (𝐴 ∈ 𝑉 → (dom 𝐴 ∪ ran 𝐴) ∈ V)
2726resiexd 7214 . . . . . 6 (𝐴 ∈ 𝑉 → ( I ↾ (dom 𝐴 ∪ ran 𝐴)) ∈ V)
2822, 27ax-mp 5 . . . . 5 ( I ↾ (dom 𝐴 ∪ ran 𝐴)) ∈ V
2923, 28unex 7750 . . . 4 (𝐴 ∪ ( I ↾ (dom 𝐴 ∪ ran 𝐴))) ∈ V
30 dmeq 5885 . . . . . . . 8 (𝑥 = (𝐴 ∪ ( I ↾ (dom 𝐴 ∪ ran 𝐴))) → dom 𝑥 = dom (𝐴 ∪ ( I ↾ (dom 𝐴 ∪ ran 𝐴))))
31 rneq 5918 . . . . . . . 8 (𝑥 = (𝐴 ∪ ( I ↾ (dom 𝐴 ∪ ran 𝐴))) → ran 𝑥 = ran (𝐴 ∪ ( I ↾ (dom 𝐴 ∪ ran 𝐴))))
3230, 31uneq12d 4116 . . . . . . 7 (𝑥 = (𝐴 ∪ ( I ↾ (dom 𝐴 ∪ ran 𝐴))) → (dom 𝑥 ∪ ran 𝑥) = (dom (𝐴 ∪ ( I ↾ (dom 𝐴 ∪ ran 𝐴))) ∪ ran (𝐴 ∪ ( I ↾ (dom 𝐴 ∪ ran 𝐴)))))
3332reseq2d 5970 . . . . . 6 (𝑥 = (𝐴 ∪ ( I ↾ (dom 𝐴 ∪ ran 𝐴))) → ( I ↾ (dom 𝑥 ∪ ran 𝑥)) = ( I ↾ (dom (𝐴 ∪ ( I ↾ (dom 𝐴 ∪ ran 𝐴))) ∪ ran (𝐴 ∪ ( I ↾ (dom 𝐴 ∪ ran 𝐴))))))
34 id 23 . . . . . 6 (𝑥 = (𝐴 ∪ ( I ↾ (dom 𝐴 ∪ ran 𝐴))) → 𝑥 = (𝐴 ∪ ( I ↾ (dom 𝐴 ∪ ran 𝐴))))
3533, 34sseq12d 3964 . . . . 5 (𝑥 = (𝐴 ∪ ( I ↾ (dom 𝐴 ∪ ran 𝐴))) → (( I ↾ (dom 𝑥 ∪ ran 𝑥)) ⊆ 𝑥 ↔ ( I ↾ (dom (𝐴 ∪ ( I ↾ (dom 𝐴 ∪ ran 𝐴))) ∪ ran (𝐴 ∪ ( I ↾ (dom 𝐴 ∪ ran 𝐴))))) ⊆ (𝐴 ∪ ( I ↾ (dom 𝐴 ∪ ran 𝐴)))))
3635cleq2lem 44567 . . . 4 (𝑥 = (𝐴 ∪ ( I ↾ (dom 𝐴 ∪ ran 𝐴))) → ((𝐴 ⊆ 𝑥 ∧ ( I ↾ (dom 𝑥 ∪ ran 𝑥)) ⊆ 𝑥) ↔ (𝐴 ⊆ (𝐴 ∪ ( I ↾ (dom 𝐴 ∪ ran 𝐴))) ∧ ( I ↾ (dom (𝐴 ∪ ( I ↾ (dom 𝐴 ∪ ran 𝐴))) ∪ ran (𝐴 ∪ ( I ↾ (dom 𝐴 ∪ ran 𝐴))))) ⊆ (𝐴 ∪ ( I ↾ (dom 𝐴 ∪ ran 𝐴))))))
3729, 36spcev 3561 . . 3 ((𝐴 ⊆ (𝐴 ∪ ( I ↾ (dom 𝐴 ∪ ran 𝐴))) ∧ ( I ↾ (dom (𝐴 ∪ ( I ↾ (dom 𝐴 ∪ ran 𝐴))) ∪ ran (𝐴 ∪ ( I ↾ (dom 𝐴 ∪ ran 𝐴))))) ⊆ (𝐴 ∪ ( I ↾ (dom 𝐴 ∪ ran 𝐴)))) → ∃𝑥(𝐴 ⊆ 𝑥 ∧ ( I ↾ (dom 𝑥 ∪ ran 𝑥)) ⊆ 𝑥))
38 intexab 5307 . . 3 (∃𝑥(𝐴 ⊆ 𝑥 ∧ ( I ↾ (dom 𝑥 ∪ ran 𝑥)) ⊆ 𝑥) ↔ ∩ {𝑥 ∣ (𝐴 ⊆ 𝑥 ∧ ( I ↾ (dom 𝑥 ∪ ran 𝑥)) ⊆ 𝑥)} ∈ V)
3937, 38sylib 221 . 2 ((𝐴 ⊆ (𝐴 ∪ ( I ↾ (dom 𝐴 ∪ ran 𝐴))) ∧ ( I ↾ (dom (𝐴 ∪ ( I ↾ (dom 𝐴 ∪ ran 𝐴))) ∪ ran (𝐴 ∪ ( I ↾ (dom 𝐴 ∪ ran 𝐴))))) ⊆ (𝐴 ∪ ( I ↾ (dom 𝐴 ∪ ran 𝐴)))) → ∩ {𝑥 ∣ (𝐴 ⊆ 𝑥 ∧ ( I ↾ (dom 𝑥 ∪ ran 𝑥)) ⊆ 𝑥)} ∈ V)
401, 21, 39mp2an 705 1 ∩ {𝑥 ∣ (𝐴 ⊆ 𝑥 ∧ ( I ↾ (dom 𝑥 ∪ ran 𝑥)) ⊆ 𝑥)} ∈ V
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   ∧ wa 401   = wceq 1570  ∃wex 1812   ∈ wcel 2145  {cab 2739  Vcvv 3451   ∪ cun 3897   ⊆ wss 3899  ∩ cint 4907   I cid 5545  dom cdm 5651  ran crn 5652   ↾ cres 5653
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-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pr 5391  ax-un 7740
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-nf 1817  df-sb 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-int 4908  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-iota 6487  df-fun 6533  df-fn 6534  df-f 6535  df-f1 6536  df-fo 6537  df-f1o 6538  df-fv 6539
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator