Users' Mathboxes Mathbox for Glauco Siliprandi < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  restuni3 Structured version   Visualization version   GIF version

Theorem restuni3 45548
Description: The underlying set of a subspace induced by the subspace operator t. The result can be applied, for instance, to topologies and sigma-algebras. (Contributed by Glauco Siliprandi, 26-Jun-2021.)
Hypotheses
Ref Expression
restuni3.1 (𝜑𝐴𝑉)
restuni3.2 (𝜑𝐵𝑊)
Assertion
Ref Expression
restuni3 (𝜑 (𝐴t 𝐵) = ( 𝐴𝐵))

Proof of Theorem restuni3
Dummy variables 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 eluni2 4854 . . . . . . . 8 (𝑥 (𝐴t 𝐵) ↔ ∃𝑦 ∈ (𝐴t 𝐵)𝑥𝑦)
21biimpi 216 . . . . . . 7 (𝑥 (𝐴t 𝐵) → ∃𝑦 ∈ (𝐴t 𝐵)𝑥𝑦)
32adantl 481 . . . . . 6 ((𝜑𝑥 (𝐴t 𝐵)) → ∃𝑦 ∈ (𝐴t 𝐵)𝑥𝑦)
4 simpr 484 . . . . . . . . . . . 12 ((𝜑𝑦 ∈ (𝐴t 𝐵)) → 𝑦 ∈ (𝐴t 𝐵))
5 restuni3.1 . . . . . . . . . . . . . 14 (𝜑𝐴𝑉)
6 restuni3.2 . . . . . . . . . . . . . 14 (𝜑𝐵𝑊)
7 elrest 17390 . . . . . . . . . . . . . 14 ((𝐴𝑉𝐵𝑊) → (𝑦 ∈ (𝐴t 𝐵) ↔ ∃𝑧𝐴 𝑦 = (𝑧𝐵)))
85, 6, 7syl2anc 585 . . . . . . . . . . . . 13 (𝜑 → (𝑦 ∈ (𝐴t 𝐵) ↔ ∃𝑧𝐴 𝑦 = (𝑧𝐵)))
98adantr 480 . . . . . . . . . . . 12 ((𝜑𝑦 ∈ (𝐴t 𝐵)) → (𝑦 ∈ (𝐴t 𝐵) ↔ ∃𝑧𝐴 𝑦 = (𝑧𝐵)))
104, 9mpbid 232 . . . . . . . . . . 11 ((𝜑𝑦 ∈ (𝐴t 𝐵)) → ∃𝑧𝐴 𝑦 = (𝑧𝐵))
11103adant3 1133 . . . . . . . . . 10 ((𝜑𝑦 ∈ (𝐴t 𝐵) ∧ 𝑥𝑦) → ∃𝑧𝐴 𝑦 = (𝑧𝐵))
12 simpl 482 . . . . . . . . . . . . . 14 ((𝑥𝑦𝑦 = (𝑧𝐵)) → 𝑥𝑦)
13 simpr 484 . . . . . . . . . . . . . 14 ((𝑥𝑦𝑦 = (𝑧𝐵)) → 𝑦 = (𝑧𝐵))
1412, 13eleqtrd 2838 . . . . . . . . . . . . 13 ((𝑥𝑦𝑦 = (𝑧𝐵)) → 𝑥 ∈ (𝑧𝐵))
1514ex 412 . . . . . . . . . . . 12 (𝑥𝑦 → (𝑦 = (𝑧𝐵) → 𝑥 ∈ (𝑧𝐵)))
16153ad2ant3 1136 . . . . . . . . . . 11 ((𝜑𝑦 ∈ (𝐴t 𝐵) ∧ 𝑥𝑦) → (𝑦 = (𝑧𝐵) → 𝑥 ∈ (𝑧𝐵)))
1716reximdv 3152 . . . . . . . . . 10 ((𝜑𝑦 ∈ (𝐴t 𝐵) ∧ 𝑥𝑦) → (∃𝑧𝐴 𝑦 = (𝑧𝐵) → ∃𝑧𝐴 𝑥 ∈ (𝑧𝐵)))
1811, 17mpd 15 . . . . . . . . 9 ((𝜑𝑦 ∈ (𝐴t 𝐵) ∧ 𝑥𝑦) → ∃𝑧𝐴 𝑥 ∈ (𝑧𝐵))
19183exp 1120 . . . . . . . 8 (𝜑 → (𝑦 ∈ (𝐴t 𝐵) → (𝑥𝑦 → ∃𝑧𝐴 𝑥 ∈ (𝑧𝐵))))
2019rexlimdv 3136 . . . . . . 7 (𝜑 → (∃𝑦 ∈ (𝐴t 𝐵)𝑥𝑦 → ∃𝑧𝐴 𝑥 ∈ (𝑧𝐵)))
2120adantr 480 . . . . . 6 ((𝜑𝑥 (𝐴t 𝐵)) → (∃𝑦 ∈ (𝐴t 𝐵)𝑥𝑦 → ∃𝑧𝐴 𝑥 ∈ (𝑧𝐵)))
223, 21mpd 15 . . . . 5 ((𝜑𝑥 (𝐴t 𝐵)) → ∃𝑧𝐴 𝑥 ∈ (𝑧𝐵))
23 elinel1 4141 . . . . . . . . . . 11 (𝑥 ∈ (𝑧𝐵) → 𝑥𝑧)
2423adantl 481 . . . . . . . . . 10 ((𝑧𝐴𝑥 ∈ (𝑧𝐵)) → 𝑥𝑧)
25 simpl 482 . . . . . . . . . 10 ((𝑧𝐴𝑥 ∈ (𝑧𝐵)) → 𝑧𝐴)
26 elunii 4855 . . . . . . . . . 10 ((𝑥𝑧𝑧𝐴) → 𝑥 𝐴)
2724, 25, 26syl2anc 585 . . . . . . . . 9 ((𝑧𝐴𝑥 ∈ (𝑧𝐵)) → 𝑥 𝐴)
28 elinel2 4142 . . . . . . . . . 10 (𝑥 ∈ (𝑧𝐵) → 𝑥𝐵)
2928adantl 481 . . . . . . . . 9 ((𝑧𝐴𝑥 ∈ (𝑧𝐵)) → 𝑥𝐵)
3027, 29elind 4140 . . . . . . . 8 ((𝑧𝐴𝑥 ∈ (𝑧𝐵)) → 𝑥 ∈ ( 𝐴𝐵))
3130ex 412 . . . . . . 7 (𝑧𝐴 → (𝑥 ∈ (𝑧𝐵) → 𝑥 ∈ ( 𝐴𝐵)))
3231adantl 481 . . . . . 6 (((𝜑𝑥 (𝐴t 𝐵)) ∧ 𝑧𝐴) → (𝑥 ∈ (𝑧𝐵) → 𝑥 ∈ ( 𝐴𝐵)))
3332rexlimdva 3138 . . . . 5 ((𝜑𝑥 (𝐴t 𝐵)) → (∃𝑧𝐴 𝑥 ∈ (𝑧𝐵) → 𝑥 ∈ ( 𝐴𝐵)))
3422, 33mpd 15 . . . 4 ((𝜑𝑥 (𝐴t 𝐵)) → 𝑥 ∈ ( 𝐴𝐵))
3534ralrimiva 3129 . . 3 (𝜑 → ∀𝑥 (𝐴t 𝐵)𝑥 ∈ ( 𝐴𝐵))
36 dfss3 3910 . . 3 ( (𝐴t 𝐵) ⊆ ( 𝐴𝐵) ↔ ∀𝑥 (𝐴t 𝐵)𝑥 ∈ ( 𝐴𝐵))
3735, 36sylibr 234 . 2 (𝜑 (𝐴t 𝐵) ⊆ ( 𝐴𝐵))
38 elinel1 4141 . . . . . 6 (𝑥 ∈ ( 𝐴𝐵) → 𝑥 𝐴)
39 eluni2 4854 . . . . . 6 (𝑥 𝐴 ↔ ∃𝑧𝐴 𝑥𝑧)
4038, 39sylib 218 . . . . 5 (𝑥 ∈ ( 𝐴𝐵) → ∃𝑧𝐴 𝑥𝑧)
4140adantl 481 . . . 4 ((𝜑𝑥 ∈ ( 𝐴𝐵)) → ∃𝑧𝐴 𝑥𝑧)
425adantr 480 . . . . . . . . . 10 ((𝜑𝑧𝐴) → 𝐴𝑉)
436adantr 480 . . . . . . . . . 10 ((𝜑𝑧𝐴) → 𝐵𝑊)
44 simpr 484 . . . . . . . . . 10 ((𝜑𝑧𝐴) → 𝑧𝐴)
45 eqid 2736 . . . . . . . . . 10 (𝑧𝐵) = (𝑧𝐵)
4642, 43, 44, 45elrestd 45538 . . . . . . . . 9 ((𝜑𝑧𝐴) → (𝑧𝐵) ∈ (𝐴t 𝐵))
47463adant3 1133 . . . . . . . 8 ((𝜑𝑧𝐴𝑥𝑧) → (𝑧𝐵) ∈ (𝐴t 𝐵))
48473adant1r 1179 . . . . . . 7 (((𝜑𝑥 ∈ ( 𝐴𝐵)) ∧ 𝑧𝐴𝑥𝑧) → (𝑧𝐵) ∈ (𝐴t 𝐵))
49 simp3 1139 . . . . . . . 8 (((𝜑𝑥 ∈ ( 𝐴𝐵)) ∧ 𝑧𝐴𝑥𝑧) → 𝑥𝑧)
50 simp1r 1200 . . . . . . . . 9 (((𝜑𝑥 ∈ ( 𝐴𝐵)) ∧ 𝑧𝐴𝑥𝑧) → 𝑥 ∈ ( 𝐴𝐵))
51 elinel2 4142 . . . . . . . . 9 (𝑥 ∈ ( 𝐴𝐵) → 𝑥𝐵)
5250, 51syl 17 . . . . . . . 8 (((𝜑𝑥 ∈ ( 𝐴𝐵)) ∧ 𝑧𝐴𝑥𝑧) → 𝑥𝐵)
53 simpl 482 . . . . . . . . 9 ((𝑥𝑧𝑥𝐵) → 𝑥𝑧)
54 simpr 484 . . . . . . . . 9 ((𝑥𝑧𝑥𝐵) → 𝑥𝐵)
5553, 54elind 4140 . . . . . . . 8 ((𝑥𝑧𝑥𝐵) → 𝑥 ∈ (𝑧𝐵))
5649, 52, 55syl2anc 585 . . . . . . 7 (((𝜑𝑥 ∈ ( 𝐴𝐵)) ∧ 𝑧𝐴𝑥𝑧) → 𝑥 ∈ (𝑧𝐵))
57 eleq2 2825 . . . . . . . 8 (𝑦 = (𝑧𝐵) → (𝑥𝑦𝑥 ∈ (𝑧𝐵)))
5857rspcev 3564 . . . . . . 7 (((𝑧𝐵) ∈ (𝐴t 𝐵) ∧ 𝑥 ∈ (𝑧𝐵)) → ∃𝑦 ∈ (𝐴t 𝐵)𝑥𝑦)
5948, 56, 58syl2anc 585 . . . . . 6 (((𝜑𝑥 ∈ ( 𝐴𝐵)) ∧ 𝑧𝐴𝑥𝑧) → ∃𝑦 ∈ (𝐴t 𝐵)𝑥𝑦)
60593exp 1120 . . . . 5 ((𝜑𝑥 ∈ ( 𝐴𝐵)) → (𝑧𝐴 → (𝑥𝑧 → ∃𝑦 ∈ (𝐴t 𝐵)𝑥𝑦)))
6160rexlimdv 3136 . . . 4 ((𝜑𝑥 ∈ ( 𝐴𝐵)) → (∃𝑧𝐴 𝑥𝑧 → ∃𝑦 ∈ (𝐴t 𝐵)𝑥𝑦))
6241, 61mpd 15 . . 3 ((𝜑𝑥 ∈ ( 𝐴𝐵)) → ∃𝑦 ∈ (𝐴t 𝐵)𝑥𝑦)
6362, 1sylibr 234 . 2 ((𝜑𝑥 ∈ ( 𝐴𝐵)) → 𝑥 (𝐴t 𝐵))
6437, 63eqelssd 3943 1 (𝜑 (𝐴t 𝐵) = ( 𝐴𝐵))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395  w3a 1087   = wceq 1542  wcel 2114  wral 3051  wrex 3061  cin 3888  wss 3889   cuni 4850  (class class class)co 7367  t crest 17383
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-10 2147  ax-11 2163  ax-12 2185  ax-ext 2708  ax-rep 5212  ax-sep 5231  ax-nul 5241  ax-pr 5375  ax-un 7689
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-nf 1786  df-sb 2069  df-mo 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3062  df-reu 3343  df-rab 3390  df-v 3431  df-sbc 3729  df-csb 3838  df-dif 3892  df-un 3894  df-in 3896  df-ss 3906  df-nul 4274  df-if 4467  df-sn 4568  df-pr 4570  df-op 4574  df-uni 4851  df-iun 4935  df-br 5086  df-opab 5148  df-mpt 5167  df-id 5526  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-rn 5642  df-res 5643  df-ima 5644  df-iota 6454  df-fun 6500  df-fn 6501  df-f 6502  df-f1 6503  df-fo 6504  df-f1o 6505  df-fv 6506  df-ov 7370  df-oprab 7371  df-mpo 7372  df-rest 17385
This theorem is referenced by:  restuni4  45551  subsalsal  46787
  Copyright terms: Public domain W3C validator