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

Theorem relexp0eq 44701
Description: The zeroth power of relationships is the same if and only if the union of their domain and ranges is the same. (Contributed by RP, 11-Jun-2020.)
Assertion
Ref Expression
relexp0eq ((𝐴 ∈ 𝑈 ∧ 𝐵 ∈ 𝑉) → ((dom 𝐴 ∪ ran 𝐴) = (dom 𝐵 ∪ ran 𝐵) ↔ (𝐴↑𝑟0) = (𝐵↑𝑟0)))

Proof of Theorem relexp0eq
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 dfcleq 2753 . . . 4 ((dom 𝐴 ∪ ran 𝐴) = (dom 𝐵 ∪ ran 𝐵) ↔ ∀𝑥(𝑥 ∈ (dom 𝐴 ∪ ran 𝐴) ↔ 𝑥 ∈ (dom 𝐵 ∪ ran 𝐵)))
2 alcom 2195 . . . . 5 (∀𝑦∀𝑥(𝑥 ∈ (dom 𝐴 ∪ ran 𝐴) ↔ 𝑥 ∈ (dom 𝐵 ∪ ran 𝐵)) ↔ ∀𝑥∀𝑦(𝑥 ∈ (dom 𝐴 ∪ ran 𝐴) ↔ 𝑥 ∈ (dom 𝐵 ∪ ran 𝐵)))
3 19.3v 2014 . . . . 5 (∀𝑦∀𝑥(𝑥 ∈ (dom 𝐴 ∪ ran 𝐴) ↔ 𝑥 ∈ (dom 𝐵 ∪ ran 𝐵)) ↔ ∀𝑥(𝑥 ∈ (dom 𝐴 ∪ ran 𝐴) ↔ 𝑥 ∈ (dom 𝐵 ∪ ran 𝐵)))
4 ax6ev 2001 . . . . . . . . 9 ∃𝑦 𝑦 = 𝑥
5 pm5.5 364 . . . . . . . . 9 (∃𝑦 𝑦 = 𝑥 → ((∃𝑦 𝑦 = 𝑥 → (𝑥 ∈ (dom 𝐴 ∪ ran 𝐴) ↔ 𝑥 ∈ (dom 𝐵 ∪ ran 𝐵))) ↔ (𝑥 ∈ (dom 𝐴 ∪ ran 𝐴) ↔ 𝑥 ∈ (dom 𝐵 ∪ ran 𝐵))))
64, 5ax-mp 5 . . . . . . . 8 ((∃𝑦 𝑦 = 𝑥 → (𝑥 ∈ (dom 𝐴 ∪ ran 𝐴) ↔ 𝑥 ∈ (dom 𝐵 ∪ ran 𝐵))) ↔ (𝑥 ∈ (dom 𝐴 ∪ ran 𝐴) ↔ 𝑥 ∈ (dom 𝐵 ∪ ran 𝐵)))
7 19.23v 1974 . . . . . . . 8 (∀𝑦(𝑦 = 𝑥 → (𝑥 ∈ (dom 𝐴 ∪ ran 𝐴) ↔ 𝑥 ∈ (dom 𝐵 ∪ ran 𝐵))) ↔ (∃𝑦 𝑦 = 𝑥 → (𝑥 ∈ (dom 𝐴 ∪ ran 𝐴) ↔ 𝑥 ∈ (dom 𝐵 ∪ ran 𝐵))))
8 19.3v 2014 . . . . . . . 8 (∀𝑦(𝑥 ∈ (dom 𝐴 ∪ ran 𝐴) ↔ 𝑥 ∈ (dom 𝐵 ∪ ran 𝐵)) ↔ (𝑥 ∈ (dom 𝐴 ∪ ran 𝐴) ↔ 𝑥 ∈ (dom 𝐵 ∪ ran 𝐵)))
96, 7, 83bitr4ri 307 . . . . . . 7 (∀𝑦(𝑥 ∈ (dom 𝐴 ∪ ran 𝐴) ↔ 𝑥 ∈ (dom 𝐵 ∪ ran 𝐵)) ↔ ∀𝑦(𝑦 = 𝑥 → (𝑥 ∈ (dom 𝐴 ∪ ran 𝐴) ↔ 𝑥 ∈ (dom 𝐵 ∪ ran 𝐵))))
10 pm5.32 584 . . . . . . . . 9 ((𝑦 = 𝑥 → (𝑥 ∈ (dom 𝐴 ∪ ran 𝐴) ↔ 𝑥 ∈ (dom 𝐵 ∪ ran 𝐵))) ↔ ((𝑦 = 𝑥 ∧ 𝑥 ∈ (dom 𝐴 ∪ ran 𝐴)) ↔ (𝑦 = 𝑥 ∧ 𝑥 ∈ (dom 𝐵 ∪ ran 𝐵))))
11 ancom 466 . . . . . . . . . 10 ((𝑦 = 𝑥 ∧ 𝑥 ∈ (dom 𝐴 ∪ ran 𝐴)) ↔ (𝑥 ∈ (dom 𝐴 ∪ ran 𝐴) ∧ 𝑦 = 𝑥))
12 ancom 466 . . . . . . . . . 10 ((𝑦 = 𝑥 ∧ 𝑥 ∈ (dom 𝐵 ∪ ran 𝐵)) ↔ (𝑥 ∈ (dom 𝐵 ∪ ran 𝐵) ∧ 𝑦 = 𝑥))
1311, 12bibi12i 342 . . . . . . . . 9 (((𝑦 = 𝑥 ∧ 𝑥 ∈ (dom 𝐴 ∪ ran 𝐴)) ↔ (𝑦 = 𝑥 ∧ 𝑥 ∈ (dom 𝐵 ∪ ran 𝐵))) ↔ ((𝑥 ∈ (dom 𝐴 ∪ ran 𝐴) ∧ 𝑦 = 𝑥) ↔ (𝑥 ∈ (dom 𝐵 ∪ ran 𝐵) ∧ 𝑦 = 𝑥)))
1410, 13bitri 278 . . . . . . . 8 ((𝑦 = 𝑥 → (𝑥 ∈ (dom 𝐴 ∪ ran 𝐴) ↔ 𝑥 ∈ (dom 𝐵 ∪ ran 𝐵))) ↔ ((𝑥 ∈ (dom 𝐴 ∪ ran 𝐴) ∧ 𝑦 = 𝑥) ↔ (𝑥 ∈ (dom 𝐵 ∪ ran 𝐵) ∧ 𝑦 = 𝑥)))
1514albii 1851 . . . . . . 7 (∀𝑦(𝑦 = 𝑥 → (𝑥 ∈ (dom 𝐴 ∪ ran 𝐴) ↔ 𝑥 ∈ (dom 𝐵 ∪ ran 𝐵))) ↔ ∀𝑦((𝑥 ∈ (dom 𝐴 ∪ ran 𝐴) ∧ 𝑦 = 𝑥) ↔ (𝑥 ∈ (dom 𝐵 ∪ ran 𝐵) ∧ 𝑦 = 𝑥)))
169, 15bitri 278 . . . . . 6 (∀𝑦(𝑥 ∈ (dom 𝐴 ∪ ran 𝐴) ↔ 𝑥 ∈ (dom 𝐵 ∪ ran 𝐵)) ↔ ∀𝑦((𝑥 ∈ (dom 𝐴 ∪ ran 𝐴) ∧ 𝑦 = 𝑥) ↔ (𝑥 ∈ (dom 𝐵 ∪ ran 𝐵) ∧ 𝑦 = 𝑥)))
1716albii 1851 . . . . 5 (∀𝑥∀𝑦(𝑥 ∈ (dom 𝐴 ∪ ran 𝐴) ↔ 𝑥 ∈ (dom 𝐵 ∪ ran 𝐵)) ↔ ∀𝑥∀𝑦((𝑥 ∈ (dom 𝐴 ∪ ran 𝐴) ∧ 𝑦 = 𝑥) ↔ (𝑥 ∈ (dom 𝐵 ∪ ran 𝐵) ∧ 𝑦 = 𝑥)))
182, 3, 173bitr3i 304 . . . 4 (∀𝑥(𝑥 ∈ (dom 𝐴 ∪ ran 𝐴) ↔ 𝑥 ∈ (dom 𝐵 ∪ ran 𝐵)) ↔ ∀𝑥∀𝑦((𝑥 ∈ (dom 𝐴 ∪ ran 𝐴) ∧ 𝑦 = 𝑥) ↔ (𝑥 ∈ (dom 𝐵 ∪ ran 𝐵) ∧ 𝑦 = 𝑥)))
191, 18bitri 278 . . 3 ((dom 𝐴 ∪ ran 𝐴) = (dom 𝐵 ∪ ran 𝐵) ↔ ∀𝑥∀𝑦((𝑥 ∈ (dom 𝐴 ∪ ran 𝐴) ∧ 𝑦 = 𝑥) ↔ (𝑥 ∈ (dom 𝐵 ∪ ran 𝐵) ∧ 𝑦 = 𝑥)))
20 eqopab2bw 5522 . . 3 ({⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ (dom 𝐴 ∪ ran 𝐴) ∧ 𝑦 = 𝑥)} = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ (dom 𝐵 ∪ ran 𝐵) ∧ 𝑦 = 𝑥)} ↔ ∀𝑥∀𝑦((𝑥 ∈ (dom 𝐴 ∪ ran 𝐴) ∧ 𝑦 = 𝑥) ↔ (𝑥 ∈ (dom 𝐵 ∪ ran 𝐵) ∧ 𝑦 = 𝑥)))
21 opabresid 6041 . . . . 5 ( I ↾ (dom 𝐴 ∪ ran 𝐴)) = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ (dom 𝐴 ∪ ran 𝐴) ∧ 𝑦 = 𝑥)}
2221eqcomi 2769 . . . 4 {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ (dom 𝐴 ∪ ran 𝐴) ∧ 𝑦 = 𝑥)} = ( I ↾ (dom 𝐴 ∪ ran 𝐴))
23 opabresid 6041 . . . . 5 ( I ↾ (dom 𝐵 ∪ ran 𝐵)) = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ (dom 𝐵 ∪ ran 𝐵) ∧ 𝑦 = 𝑥)}
2423eqcomi 2769 . . . 4 {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ (dom 𝐵 ∪ ran 𝐵) ∧ 𝑦 = 𝑥)} = ( I ↾ (dom 𝐵 ∪ ran 𝐵))
2522, 24eqeq12i 2778 . . 3 ({⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ (dom 𝐴 ∪ ran 𝐴) ∧ 𝑦 = 𝑥)} = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ (dom 𝐵 ∪ ran 𝐵) ∧ 𝑦 = 𝑥)} ↔ ( I ↾ (dom 𝐴 ∪ ran 𝐴)) = ( I ↾ (dom 𝐵 ∪ ran 𝐵)))
2619, 20, 253bitr2i 302 . 2 ((dom 𝐴 ∪ ran 𝐴) = (dom 𝐵 ∪ ran 𝐵) ↔ ( I ↾ (dom 𝐴 ∪ ran 𝐴)) = ( I ↾ (dom 𝐵 ∪ ran 𝐵)))
27 relexp0g 15175 . . 3 (𝐴 ∈ 𝑈 → (𝐴↑𝑟0) = ( I ↾ (dom 𝐴 ∪ ran 𝐴)))
28 relexp0g 15175 . . 3 (𝐵 ∈ 𝑉 → (𝐵↑𝑟0) = ( I ↾ (dom 𝐵 ∪ ran 𝐵)))
2927, 28eqeqan12d 2774 . 2 ((𝐴 ∈ 𝑈 ∧ 𝐵 ∈ 𝑉) → ((𝐴↑𝑟0) = (𝐵↑𝑟0) ↔ ( I ↾ (dom 𝐴 ∪ ran 𝐴)) = ( I ↾ (dom 𝐵 ∪ ran 𝐵))))
3026, 29bitr4id 293 1 ((𝐴 ∈ 𝑈 ∧ 𝐵 ∈ 𝑉) → ((dom 𝐴 ∪ ran 𝐴) = (dom 𝐵 ∪ ran 𝐵) ↔ (𝐴↑𝑟0) = (𝐵↑𝑟0)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401  ∀wal 1567   = wceq 1569  ∃wex 1811   ∈ wcel 2144   ∪ cun 4149  {copab 5166   I cid 5544  dom cdm 5650  ran crn 5651   ↾ cres 5652  (class class class)co 7420  0cc0 11200  ↑𝑟crelexp 15172
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-pow 5326  ax-pr 5390  ax-un 7751  ax-1cn 11258  ax-icn 11259  ax-addcl 11260  ax-mulcl 11262  ax-i2m1 11268
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-sbc 3739  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-br 5103  df-opab 5167  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-iota 6494  df-fun 6540  df-fv 6546  df-ov 7423  df-oprab 7424  df-mpo 7425  df-n0 12607  df-relexp 15173
This theorem is used by:  iunrelexp0  44702
  Copyright terms: Public domain W3C validator